Locally constrained graph homomorphisms and equitable partitions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locally constrained graph homomorphisms and equitable partitions

We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent characterizations of degree matrices. As a consequence we can efficiently check whether a given matrix M is a degree matrix of some graph and also compute the size of a smallest graph for which it is a degree matrix in polyno...

متن کامل

Locally constrained graph homomorphisms - structure, complexity, and applications

A graph homomorphism is an edge preserving vertex mapping between two graphs. Locally constrained homomorphisms are those that behave well on the neighborhoods of vertices — if the neighborhood of any vertex of the source graph is mapped bijectively (injectively, surjectively) to the neighborhood of its image in the target graph, the homomorphism is called locally bijective (injective, surjecti...

متن کامل

Equitable Partitions and Orbit Partitions

We consider two kinds of partition of a graph, namely orbit partitions and equitable partitions. Although an orbit partition is always an equitable partition, the converse is not true in general. We look at some classes of graphs for which the converse is true.

متن کامل

Perfect State Transfer, Graph Products and Equitable Partitions

We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on generalizations of the double cones and variants of the Cartesian graph products (which include the hypercube). We also describe a generalization of the path collapsing argument (which reduces questions about perfect state transfer to simpler weighted mul...

متن کامل

α-Kuramoto partitions: graph partitions from the frustrated Kuramoto model generalise equitable partitions

The Kuramoto model describes the collective dynamics of a system of coupled oscillators. An α-Kuramoto partition is a graph partition induced by the Kuramoto model, when the oscillators include a phase frustration parameter. We prove that every equitable partition is an α-Kuramoto partition, but that the converse does necessarily not hold. We give an exact characterisation of α-Kuramoto biparti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 2008

ISSN: 0195-6698

DOI: 10.1016/j.ejc.2007.11.006